Augmented Lagrangian Method, Dual Methods, and Split Bregman Iteration for ROF, Vectorial TV, and High Order Models
نویسندگان
چکیده
In image processing, the Rudin-Osher-Fatemi (ROF) model [L. Rudin, S. Osher, and E. Fatemi, Physica D, 60(1992), pp. 259–268] based on total variation (TV) minimization has proven to be very useful. A lot of efforts have been devoted to obtain fast numerical schemes and overcome the non-differentiability of the model. Methods considered to be particularly efficient for the ROF model include the dual methods of Chan-Golub-Mulet (CGM) [T.F. Chan, G.H. Golub, and P. Mulet, SIAM J. Sci. Comput., 20(1999), pp. 1964–1977] and Chambolle [A. Chambolle, J. Math. Imaging Vis., 20(2004), pp. 89–97], and splitting and penalty based method [Y. Wang, J. Yang, W. Yin, and Y. Zhang, SIAM J. Imaging Sciences, 1(2008), pp. 248–272], as well as split Bregman iteration [T. Goldstein, and S. Osher, SIAM J. Imaging Sciences, 2(2009), pp. 323–343]. In this paper, we propose to use augmented Lagrangian method to solve the model. Convergence analysis will be given for the method. In addition, we observe close connections between the method proposed here and some of the existing methods. We show that the augmented Lagrangian method, dual methods, and split Bregman iteration are different iterative procedures to solve the same system. Moreover, the proposed method is extended to vectorial TV and high order models. Using the approach here, we can easily obtain the CGM dual method and split Bregman iteration for vectorial TV and high order models, which, to our best of knowledge, have not been presented in the literature. Numerical examples demonstrate the efficiency and accuracy of our method.
منابع مشابه
Augmented Lagrangian Method, Dual Methods and Split Bregman Iteration for ROF Model
In the recent decades the ROF model (total variation (TV) minimization) has made great successes in image restoration due to its good edge-preserving property. However, the non-differentiability of the minimization problem brings computational difficulties. Different techniques have been proposed to overcome this difficulty. Therein methods regarded to be particularly efficient include dual met...
متن کاملLagrangian multipliers and split Bregman methods for minimization problems constrained on Sn-1
The numerical methods of total variation (TV) model for image denoising, especially Rudin–Osher– Fatemi (ROF) model, is widely studied in the literature. However, the S 1 constrained counterpart is less addressed. The classical gradient descent method for the constrained problem is limited in two aspects: one is the small time step size to ensure stability; the other is that the data must be pr...
متن کاملApplications of Lagrangian-Based Alternating Direction Methods and Connections to Split Bregman
Analogous to the connection between Bregman iteration and the method of multipliers that was pointed out in [59], we show that a similar connection can be made between the split Bregman algorithm [32] and the alternating direction method of multipliers (ADMM) of ([29], [31]). Existing convergence theory for ADMM [23] can therefore be used to justify both the alternating step and inexact minimiz...
متن کاملDeblurring Poissonian images by split Bregman techniques
The restoration of blurred images corrupted by Poisson noise is an important task in various applications such as astronomical imaging, electronic microscopy, single particle emission computed tomography (SPECT) and positron emission tomography (PET). In this paper, we focus on solving this task by minimizing an energy functional consisting of the I-divergence as similarity term and the TV regu...
متن کاملA Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
In this paper, we propose a unified primal-dual algorithm framework for two classes of problems that arise from various signal and image processing applications. We also show the connections to existing methods, in particular Bregman iteration [41] based method, such as linearized Bregman [42, 9, 10, 49] and split Bregman [31]. The convergence of the general algorithm framework is proved under ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Imaging Sciences
دوره 3 شماره
صفحات -
تاریخ انتشار 2010